Digite uma palavra ou frase em qualquer idioma 👆
Idioma:
Tradução e análise de palavras por inteligência artificial ChatGPT
Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:
- como a palavra é usada
- frequência de uso
- é usado com mais frequência na fala oral ou escrita
- opções de tradução de palavras
- exemplos de uso (várias frases com tradução)
- etimologia
O que (quem) é minimax scheme - definição
ELECTORAL SYSTEM
Simpson-Kramer method; Minimax condorcet; Simpson–Kramer method; Minimax Condorcet
Minimax theorem
THEOREM PROVIDING CONDITIONS THAT GUARANTEE THAT THE MAX–MIN INEQUALITY IS ALSO AN EQUALITY
Von Neumman's minimax theorem
In the mathematical area of game theory, a minimax theorem is a theorem providing conditions that guarantee that the max–min inequality is also an equality.
R4RS
DIALECT OF THE LISP PROGRAMMING LANGUAGE
Scheme Links; R5RS; R4RS; R6RS; Set!; Scheme Programming language; Scheme progamming language; Scheme programming language; R5RS Scheme; Err5rs; ERR5RS; Scheme language; LAML; Scheme (language); RnRS; R7RS; Dr. Scheme; Scheme Lisp
A revision of R3RS, revised in R3.99RS.
ftp://altdorf.ai.mit.edu/.
["The Revised^4 Report on the Algorithmic Language Scheme", W.
Clinger et al, MIT (Nov 1991) ].
(1994-10-28)
[Later revisions? ]
MIT Scheme
A SCHEME IMPLEMENTATION WITH INTEGRATED EDITOR AND DEBUGGER
MIT Scheme; Edwin (editor); Mit-scheme
<language> (Previously "C-Scheme") A Scheme implementation
by the MIT Scheme Team (Chris Hanson, Jim Miller, Bill
Rozas, and many others) with a rich set of utilities, a
compiler called Liar and an editor called Edwin.
MIT Scheme includes an interpreter, large {run-time
library}, Emacs macros, native-code compiler, emacs-like
editor, and a source-level debugger.
Latest version: 7.7.1, as of 2002-06-18.
MIT Scheme conforms fully with R4RS and almost with the
IEEE Scheme standard. It runs on Motorola 68000:
HP9000, Sun-3, NeXT; MIPS: Decstation, Sony, SGI;
HP-PA: 600, 700, 800; VAX: Ultrix, BSD, DEC Alpha:
OSF; Intel i386: MS-DOS, MS Windows, and various other
Unix systems.
See also: LAP, Schematik, Scode.
scheme/">http://gnu.org/software/mit-scheme/.
Usenet newsgroup: news:comp.lang.scheme.c.
Mailing list: mit-scheme-announce@gnu.org (cross-posted to
news).
E-mail: <mit-scheme-devel@gnu.org> (maintainers).
(2003-08-14)
Wikipédia
Minimax Condorcet method
In voting systems, the Minimax Condorcet method (often referred to as "the Minimax method") is one of several Condorcet methods used for tabulating votes and determining a winner when using ranked voting in a single-winner election. It is sometimes referred to as the Simpson–Kramer method, and the successive reversal method.
Minimax selects as the winner the candidate whose greatest pairwise defeat is smaller than the greatest pairwise defeat of any other candidate: or, put another way, "the only candidate whose support never drops below [N] percent" in any pairwise contest.
